影响水下距离选通激光图像光学相关识别的若干因素

针对水下距离选通激光图像光学相关识别技术的应用,研究了引起图像畸变从而导致光学相关识别相关峰输出效率降低的若干因素,并通过实验的方法采集了不同系统参数设置下的激光成像图片,然后采用相位匹配的方法对图片进行相关性分析,同时应用PCE、Disc等指标联合评价输出的相关峰质量,从而衡量各因素所引起的成像畸变对光学相关识别性能的影响程度.MATLAB软件仿真结果证明:激光单脉冲能量、ICCD增益、成像距离等因素变化均会引起图像相位特征畸变,导致相关识别鉴别率降低.该结果可为建立水下距离选通成像系统控制模型和设计匹配滤波器提供参考.     

群车加油系统水力计算方法

加油系统是群车加油装备的主要系统之一,其不同工况的水力计算结果是研究和分析加油系统规律和特性的基础。介绍了新型群车加油车加油系统基本结构,针对其结构简单、工况随机多变的特点,运用排列组合知识对系统工况进行了归纳分类,共有1 023种工况组合和10种加油模式;提出距离矩阵法用于建立加油系统的随机工况数学模型,并详细阐述了模型计算过程;通过对单枪、五枪和十枪加油模式的典型工况进行计算,最终结果验证了该方法用于求解群车加油系统和其他多分支管路系统随机工况的水力计算是可行的。     

舰炮武器试验中目标坐标真值修正方法

为保证舰炮武器系统动态精度解算结果的准确性,分析了舰炮武器系统动态精度试验中,GPS作为目标瞬时坐标真值测量设备时,因其安装位置与雷达跟踪测量中心不重合所引起的误差,并提出了一种简便、可行的误差修正方法。给出了误差修正示例,比较分析了GPS不同安装位置所引起的误差,为类似试验中目标瞬时坐标真值的处理提供参考。     

宽带宽缝隙共形天线的设计及其特性研究

针对宽带共形天线需要满足剖面低、体积小、易与载体共形并且具有宽频带性能的要求,文章首先设计了一种宽带宽缝隙平面天线,采用共面波导方式(CPW)馈电,低介电常数介质板厚度仅有0.2 mm,分析了各个参数对天线特性的影响,将平面天线与柱体共形,研究了天线共形之后的阻抗特性和辐射特性的变化。仿真结果表明,平面天线的阻抗带宽(S11≤10 dB)覆盖5.35 GHz~6.7 GHz,中心频率为5.85 GHz,最大增益4.5 dB,辐射特性稳定,共形后天线的谐振频率减小,低频带宽增大,波束宽度展宽,辐射增强,阻抗带宽覆盖5.24 GHz~6.43GHz,最大增益4.6 dB,辐射特性稳定。测试结果与仿真吻合较好,天线的结构简单,易于和载体共形。     

基于信任中继的QKD网络研究

基于信任中继的量子密钥分发(QKD)网络由于其组网效果好、扩展性强、技术容易实现成为未来保密通信组网的首选方案。文章首先介绍QKD网络的分类和现状;然后提出信任中继网络的基本网络拓扑模型,在此基础上分析了网络的信道和密钥中继方式;最后提出了影响信任中继网络组网效果和性能的决定性参量,分析比较了信任中继网络采用不同选路方式的优缺点。     

非定常Euler方程数值计算中高精度格式应用

采用五阶精度加权紧致非线性格式(WCNS)和非定常“双时间步”方法求解非定常Euler方程,模拟NACA0012翼型强迫俯仰振动流场,研究了高精度格式应用到非定常计算时“双时间步”方法物理时间步长、子迭代收敛判据、子迭代步数以及物理时间导数离散方法对计算精度和计算效率的影响.     

多分辨率建模在战役推演仿真系统中的应用

战役推演仿真系统中存在大量分布在不同层次上的实体,为了使这些实体高效运行,同时保证相关信息能正确交互,研究了几种典型的多分辨率建模方法,并在分析战役推演仿真系统结构的基础上提出了一种面向多分辨率建模的仿真模块体系结构,建立了层次关系表、运行实体关系表、参数映射类和聚合解聚触发事件列表来保证多分辨率模型之间运行数据的一致性,同时避免链式解聚的问题.通过实验,按该体系结构建立的仿真系统能正确运行多分辨率模型,该框架为建立基于多分辨率建模的仿真系统提供了一定的技术支撑.     

A partial characterization of the optimal ordering/rationing policy for a periodic review system with two demand classes and backordering

We consider a finite horizon periodic review, single product inventory system with a fixed setup cost and two stochastic demand classes that differ in their backordering costs. In each period, one must decide whether and how much to order, and how much demand of the lower class should be satisfied. We show that the optimal ordering policy can be characterized as a state dependent (s,S) policy, and the rationing structure is partially obtained based on the subconvexity of the cost function. We then propose a simple heuristic rationing policy, which is easy to implement and close to optimal for intensive numerical examples. We further study the case when the first demand class is deterministic and must be satisfied immediately. We show the optimality of the state dependent (s,S) ordering policy, and obtain additional rationing structural properties. Based on these properties, the optimal ordering and rationing policy for any state can be generated by finding the optimal policy of only a finite set of states, and for each state in this set, the optimal policy is obtained simply by choosing a policy from at most two alternatives. An efficient algorithm is then proposed. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

在求“变”中推进西南边防部队转型发展

西南边防部队驻防于我国西南边境地区,西起西藏自治区的日土县,东至广西壮族自治区的防城港市,担负着边防管控和边境防御作战等重要职能,在捍卫国家主权和安全中地位作用十分特殊。随着军队调整改革的深入落实,西南边防部队正处于转型重塑的关键时期,必须紧紧围绕新形势、新体制、新职能,着眼应急指挥、军事训练、边境管控、内外环境等关键要素和现实问题,在求"变"中推进创新发展,不断提升履职能力,切实为捍卫国家领土主权完整和维护边境稳定提供坚强保证。     

Approximation results for min‐max path cover problems in vehicle routing

This article studies a min‐max path cover problem, which is to determine a set of paths for k capacitated vehicles to service all the customers in a given weighted graph so that the largest path cost is minimized. The problem has wide applications in vehicle routing, especially when the minimization of the latest service completion time is a critical performance measure. We have analyzed four typical variants of this problem, where the vehicles have either unlimited or limited capacities, and they start from either a given depot or any depot of a given depot set. We have developed approximation algorithms for these four variants, which achieve approximation ratios of max{3 ‐ 2/k,2}, 5, max{5 ‐ 2/k,4}, and 7, respectively. We have also analyzed the approximation hardness of these variants by showing that, unless P = NP , it is impossible for them to achieve approximation ratios less than 4/3, 3/2, 3/2, and 2, respectively. We have further extended the techniques and results developed for this problem to other min‐max vehicle routing problems.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010